منابع مشابه
On Separation by Locally Testable and Locally Threshold Testable Languages
A separator for two languages is a third language containing the first one and disjoint from the second one. We investigate the following decision problem: given two regular input languages, decide whether there exists a locally testable (resp. a locally threshold testable) separator. In both cases, we design a decision procedure based on the occurrence of special patterns in automata accepting...
متن کاملSeparating Regular Languages by Locally Testable and Locally Threshold Testable Languages
A separator for two languages is a third language containing the first one and disjoint from the second one. We investigate the following decision problem: given two regular input languages, decide whether there exists a locally testable (resp. a locally threshold testable) separator. In both cases, we design a decision procedure based on the occurrence of special patterns in automata accepting...
متن کاملSplicing Representations of Strictly Locally Testable Languages
The relationship between the family SH of simple splicing languages, which was recently introduced by A. Mateescu and coauthors, and the family SLT of strictly locally testable languages is clariied by establishing an ascending hierarchy of families fSiH : i ?1g of splicing languages for which SH = S1H and the union of the families is the family SLT. A procedure is given which, for an arbitrary...
متن کاملFrom Regular to Strictly Locally Testable Languages
A classical result (often credited to Y. Medvedev) states that every language recognized by a finite automaton is the homomorphic image of a local language, over a much larger so-called local alphabet, namely the alphabet of the edges of the transition graph. Local languages are characterized by the value k = 2 of the sliding window width in the McNaughton and Papert’s infinite hierarchy of str...
متن کاملLocally Threshold Testable Languages of Infinite Words
The class of nitely locally threshold testable !-languages is proved to be decidable relatively to the class of all regular !-languages. We apply this to the monadic second order theory of innnite word structures with successor function: it is decidable whether for a given monadic second-order formula there exists a rst-order formula with the same set of innnite word models.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1972
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(72)80020-5